Tackling Complex Job Shop Problems Using Operation Based Scheduling
نویسنده
چکیده
Scheduling is a combinatorial problem with important impact on both industry and commerce. If it is performed well it yields time and efficiency benefits and hence reduces costs. Genetic Algorithms have been applied to solve several types of scheduling problems; Flow Shop, Resource, Staff and Line Balancing have all been tackled. However Jobshop Scheduling is the most common problem of interest. The Job-shop Scheduling Problem (JSP) involves placing jobs onto a set of machines with the aim of minimising makespan, the total time to complete all jobs. The standard JSP model is relatively simple and cannot cope with many real world situations. This paper outlines a new method, using an operation based construction, which expands the JSP to increase its functionality and applicability. This allows for much more complex job shop problems involving flexible machines, setup and maintenance times, deadlines and multiple optimisation criteria. The method is fully explained and demonstrated using a 20 job-4 machine example.
منابع مشابه
Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملA New Approach in Job Shop Scheduling: Overlapping Operation
In this paper, a new approach to overlapping operations in job shop scheduling is presented. In many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. In each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملMinimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times
The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...
متن کامل